NFV Orchestration over Disaggregated Metro Optical Networks with End-to-End Multi-Layer Slicing enabling Crowdsourced Live Video Streaming

Network infrastructure must support emerging applications, fulfill 5G requirements, and respond to the sudden increase of societal need for remote communications. Remarkably, crowdsourced live video streaming (CLVS) challenges operators' infrastructure with tides of users attending major sport or public events that demand high bandwidth and low latency jointly with computing capabilities at the networks' edge. The Metro-Haul project entered the scene proposing a cost-effective, agile, and disaggregated infrastructure for the metro segment encompassing optical and packet resources jointly with computing capabilities. Recently, a major Metro-Haul outcome took the form of a field trial of network function virtualization (NFV) orchestration over the multi-layer packet and disaggregated optical network testbed that demonstrated a CLVS use case. We showcased the average service creation time below 5 min, which met the key performance indicator as defined by the 5G infrastructure public private partnership. In this paper, we expand our field trial demonstration with a detailed view of the Metro-Haul testbed for the CLVS use case, the employed components, and their performance. The throughput of the service is increased from approximately 9.6 Gbps up to 35 Gbps per virtual local area network with high-performance VNFs based on single-root input/output virtualization technology

Performance issues in optical burst/packet switching

The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-642-01524-3_8This chapter summarises the activities on optical packet switching (OPS) and optical burst switching (OBS) carried out by the COST 291 partners in the last 4 years. It consists of an introduction, five sections with contributions on five different specific topics, and a final section dedicated to the conclusions. Each section contains an introductive state-of-the-art description of the specific topic and at least one contribution on that topic. The conclusions give some points on the current situation of the OPS/OBS paradigms

On total traffic domination in non-complete graphs

Abstract in Undetermined Given an undirected graph g(V, E), a set of traffic matrices H and one additional traffic matrix h, we say that H totally dominates h if, for each capacity reservation u supporting H, u also supports h using the same routing pattern. It has been shown that if vertical bar H vertical bar = 1 = (H = {(h) over cap}, say) and g, is a complete graph, H totally dominates h if, and only if, (h) over cap >= h component-wise. In this paper we give a generalized condition for vertical bar H vertical bar >= 1 and any undirected graph

A parallel iterative scheduler for asynchronous Optical Packet Switching networks

This paper presents PI-OPS (Parallel-Iterative Optical Packet Scheduler) a parallel-iterative scheduler for asynchronous Optical Packet Switching nodes with optical buffering. Optical packets are assembled by aggregating IP packets, and attaching an optical packet header. Conventional schemes process optical packet headers one by one, in a sequential form. Then, worst case algorithm response time is tightly coupled to switch size. In contrast, in PI-OPS all the optical packets received during a given time window are jointly processed to optimize the delay and output wavelength allocation, applying void filling techniques. The scheduler has a deterministic response time, independent of the traffic arrivals pattern. In addition, PI-OPS has been specifically designed to allow a parallel electronic implementation similar to the ones found in VOQ schedulers. In this respect, we evaluate the traffic loss performance of the scheduler in different settings, to dimension a set of hardware related parameters. Finally, we conduct an emulation of an FPGA implementation of a large-scale version of the scheduler. Results support the feasibility of its implementation

A Geometric Distribution Reader Anti-collision protocol for RFID Dense Reader Environments

Dense passive radio frequency identification (RFID) systems are particularly susceptible to reader collision problems, categorized by reader-to-tag and reader-to-reader collisions. Both may degrade the system performance decreasing the number of identified tags per time unit. Although many proposals have been suggested to avoid or handle these collisions, most of them are not compatible with current standards and regulations, require extra hardware and do not make an efficient use of the network resources. This paper proposes the Geometric Distribution Reader Anti-collision (GDRA), a new centralized scheduler that exploits the Sift geometric probability distribution function to minimize reader collision problems. GDRA provides higher throughput than the state-of-the-art proposals for dense reader environments and, unlike the majority of previous works, GDRA is compliant with the EPCglobal standard and ETSI EN 302 208 regulation, and can be implemented in real RFID systems without extra hardwar

Provisioning in Metro Networks Based on Photonic Integrated WaveBand ROADMs

A planning strategy overcoming the drawback of large transition bandwidths of photonic integrated WaveBand-ROADMs is proposed. Results show that, on metro horseshoes, integrated WBROADMs represent a viable cost-efficient alternative to traditional LCoS-based ROADMs

Optical Core Networks Research in thee-Photon-ONe+ Project

This paper reports a summary of the joint research activities on Optical Core Networks within the e-Photon-ONe+ project. It provides a reasonable overview of the topics considered of interest by the European research community and supports the idea of building joint research activities that can leverage on the expertise of different research groups

Guaranteeing packet order in IBWR optical packet switches with parallel iterative schedulers

The input-buffered wavelength-routed (IBWR) switch is a scalable switch fabric for optical packet switching (OPS) networks. In synchronous operation, when optical packets are of a fixed duration and aligned at switch inputs, the scheduling of this architecture can be characterised by a type of bipartite graph matching problem. This challenges the design of feasible algorithms in terms of implementation complexity and response time. A previous work presented and evaluated the insistent parallel desynchronized block matching (I-PDBM) algorithm for the IBWR switch. I-PDBM is a parallel iterative scheduler with a good performance and a simple hardware implementation. However, the algorithm does not maintain the packet sequence. In this paper, we present the I-PDBM algorithm with packet ordering (OI-PDBM), which prevents mis-sequencing and behaves as I-PDBM in terms of delay, buffer requirements and convergence speed

Gap Analysis on Open Models for Partially-Disaggregated SDN Optical Transport Environments

We report an analysis of completeness and suitability of OpenConfig, OpenROADM and OpenDevice models, for physical-impairment aware network planning, and a proof-of-concept in a partially disaggregated testbed exposing equipment information to Net2Plan through ONOS